Polynomial time approximation of dense weighted instances of MAX-CUT
نویسندگان
چکیده
We give the rst polynomial time approximability characterization of dense weighted instances of MAX-CUT, and some other dense weighted NP-hard problems in terms of their empirical weight distributions. This gives also the rst almost sharp characterization of inapproximability of unweighted 0,1 MAX-BISECTION instances in terms of their density parameter only.
منابع مشابه
Approximation Complexity of Nondense Instances of MAX-CUT
We prove existence of approximation schemes for instances of MAXCUT with Ω( 2 ∆ ) edges which work in 2 O ( ∆ ε2 ) nO(1) time. This entails in particular existence of quasi-polynomial approximation schemes (QPTASs) for mildly sparse instances of MAX-CUT with Ω( n 2 polylogn) edges. The result depends on new sampling method for smoothed linear programs that approximate MAX-CUT. On the other hand...
متن کاملSub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse
It has long been known, since the classical work of (Arora, Karger, Karpinski, JCSS 99), that Max-CUT admits a PTAS on dense graphs, and more generally, Max-k-CSP admits a PTAS on “dense” instances with Ω(n) constraints. In this paper we extend and generalize their exhaustive sampling approach, presenting a framework for (1−ε)-approximating any Max-k-CSP problem in sub-exponential time while si...
متن کامل18 . S 096 : Approximation Algorithms and Max - Cut Topics in Mathematics of Data Science ( Fall 2015 ) Afonso
Unless the widely believed P 6= NP conjecture is false, there is no polynomial algorithm that can solve all instances of an NP-hard problem. Thus, when faced with an NP-hard problem (such as the Max-Cut problem discussed below) one has three options: to use an exponential type algorithm that solves exactly the problem in all instances, to design polynomial time algorithms that only work for som...
متن کاملThe complexity of approximating PSPACE-Complete problems for hierarchical specifications
We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically speciied graphs, many of which are PSPACE-complete. Assuming P 6 = PSPACE, the existence or nonexistence of such eecient approximation algorithms is characterized, for several standard graph theoretic and combinatorial problems. We present polynomial time approximation algorithms for severa...
متن کاملApproximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold
We give a deterministic polynomial-time algorithm which for any given average degree d and asymptotically almost all random graphs G in G(n,m = d2n ) outputs a cut of G whose ratio (in cardinality) with the maximum cut is at least 0.952. We remind the reader that it is known that unless P=NP, for no constant > 0 is there a Max-Cut approximation algorithm that for all inputs achieves an approxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 5 شماره
صفحات -
تاریخ انتشار 1998